An experimental study of sponsored-search auctions
نویسندگان
چکیده
We study the Generalized Second Price auctions—a standard method for allocating online search advertising—experimentally, considering both the static environment assumed by the prevailing theory and a dynamic game capturing the salient aspects of real-world search advertising auctions. Subjects of our experiment bid consistently with the leading equilibrium notions, but exhibit significant overbidding relative to the Vickrey-Clarke-Groves (VCG) outcome favored as an equilibrium selection in the literature. The observed bidding behavior is well explained by a model that explicitly accounts for the strategic uncertainty facing a bidder, which suggests strategic uncertainty as a source of the observed departure from the VCG outcome. Meanwhile, the ⇤We are grateful to Jacob and Michelle Goeree, John Kagel, Dan Levin, Michael Ostrovsky, Michael Schwarz, Yan Chen, and the participants at the AMMA 2011, Monash University, Ohio State University, University of East Anglia, University of Michigan, Universitat Pompeu Fabra, University of Zurich, and the WCU Market Design Conference held at Yonsei University in August 2010, for valuable comments, and to Brian Wallace for writing the experimental program, and to Tom Rutter for helping us run the experiment. Che and Kim acknowledge the support by WCU program through the National Research Foundation of Korea funded by the Ministry of Education, Science and Technology (R32-2008-000-10056-0). Choi acknowledges the Economic and Social Research Council (UK) Grant No. RES-061-25-0348 and via the ELSE for financial support. †Department of Economics, Columbia University, 420 West 118th St, 10161AB, New York, NY 10027, USA (Email: [email protected], URL: http://www.columbia.edu/ ̃yc2271). ‡Department of Economics, University College London, Gower Street, London WC1E 6BT, UK (Email: [email protected], URL: http://www.homepages.ucl.ac.uk/ ̃uctpsc0). §Department of Economics, Seoul National University,1 Gwanak-ro Gwanak-gu, Seoul 151-742, South Korea (Email: [email protected], URL: https://sites.google.com/site/jikim72/home).
منابع مشابه
X Quantal Response Equilibrium for Sponsored Search Auctions: Computation and Inference
Sponsored search auctions have attracted much research attention in recent years and different equilibrium concepts have been studied to understand advertisers’ bidding strategies. However, the assumption that bidders are perfectly rational in these studies is unrealistic in the real world. In this work, we investigate the quantal response equilibrium (QRE) solution concept for sponsored search...
متن کاملExclusive Display in Sponsored Search Advertising
As sponsored search becomes increasingly important as an advertising medium for firms, search engines are exploring more advanced bidding and ranking mechanisms to increase their revenue from sponsored search auctions. For instance, Google, Yahoo! and Bing are investigating auction mechanisms in which each advertiser submits two bids: one bid for the standard display format in which multiple ad...
متن کاملSponsored Search Auction Design via Machine Learning∗
In this work we use techniques from the study of samplecomplexity in machine learning to reduce revenue maximizing auction problems to standard algorithmic questions. These results are particularly relevant to designing good pricing mechanisms for sponsored search. In particular we apply our results to two problems: profit maximizing combinatorial auctions, and auctions for pricing semantically...
متن کاملBudget Planning for Coupled Campaigns in Sponsored Search Auctions
Budget-related decisions in sponsored search auctions are recognized as a structured decision problem rather than a simple constraint. Budget planning over several coupled campaigns (e.g., substitution and complementarity) remains a challenging but important task for advertisers. In this paper, we propose a dynamic multicampaign budget planning approach using optimal control techniques, with co...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملMulti-unit Auctions with Budget Constraints
Motivated by sponsored search auctions, we study multi-unit auctions with budget constraints. In the mechanism we propose, Sort-Cut, understating budgets or values is weakly dominated. Since Sort-Cuts revenue is increasing in budgets and values, all kinds of equilibrium deviations from true valuations turn out to be bene cial to the auctioneer. We show that the revenue of Sort-Cut can be an or...
متن کامل